Negative prices in network pricing games

In a Stackelberg network pricing game leader sets prices for given subset of edges so as to maximize profit, after which one or multiple followers choose shortest path. Our main result shows that the profit when allowing negative can be factor ?(log?(m?k¯)) larger than maximum with only positive prices, where m is number priceable and k¯?2m followers. particular, this cannot bounded single follower.